SwiftLib: rapid degenerate-codon-library optimization through dynamic programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SwiftLib: rapid degenerate-codon-library optimization through dynamic programming

Degenerate codon (DC) libraries efficiently address the experimental library-size limitations of directed evolution by focusing diversity toward the positions and toward the amino acids (AAs) that are most likely to generate hits; however, manually constructing DC libraries is challenging, error prone and time consuming. This paper provides a dynamic programming solution to the task of finding ...

متن کامل

Optimization II: Dynamic Programming

In the last chapter, we saw that greedy algorithms are efficient solutions to certain optimization problems. However, there are optimization problems for which no greedy algorithm exists. In this chapter, we will examine a more general technique, known as dynamic programming, for solving optimization problems. Dynamic programming is a technique of implementing a top-down solution using bottom-u...

متن کامل

An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence

This paper describes and analyzes an algorithmic framework for solving nonlinear programming problems in which strict complementarity conditions and constraint qualifications are not necessarily satisfied at a solution. The framework is constructed from three main algorithmic ingredients. The first is any conventional method for nonlinear programming that produces estimates of the Lagrange mult...

متن کامل

Optimization-based Approximate Dynamic Programming

OPTIMIZATION-BASED APPROXIMATE DYNAMIC PROGRAMMING

متن کامل

Dynamic Programming via Convex Optimization

It has long been known that a wide class of problems in optimal control can be stated as infinite-dimensional convex optimization problems, where the Bellman equation is relaxed to inequality. In this paper we continue our recent efforts to show how this formulation can be used for numerical computation of optimal cost functions and control laws. In particular, we discuss new forms of discretiz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nucleic Acids Research

سال: 2014

ISSN: 1362-4962,0305-1048

DOI: 10.1093/nar/gku1323